An efficient LDU algorithm for the minimal least squares solution of linear systems
نویسندگان
چکیده
منابع مشابه
Minimal solution of fuzzy linear systems
In this paper, we use parametric form of fuzzy number and we converta fuzzy linear system to two linear system in crisp case. Conditions for the existence of a minimal solution to $mtimes n$ fuzzy linear equation systems are derived and a numerical procedure for calculating the minimal solution is designed. Numerical examples are presented to illustrate the proposed method.
متن کاملAn Efficient Algorithm for the Separable Nonlinear Least Squares Problem
The nonlinear least squares problem miny,z‖A(y)z + b(y)‖, where A(y) is a full-rank (N + `)× N matrix, y ∈ Rn, z ∈ RN and b(y) ∈ RN+` with ` ≥ n, can be solved by first solving a reduced problem miny‖ f (y)‖ to find the optimal value y∗ of y, and then solving the resulting linear least squares problem minz‖A(y∗)z + b(y∗)‖ to find the optimal value z∗ of z. We have previously justified the use o...
متن کاملLeast squares solution of nearly square overdetermined sparse linear systems
The solution of nearly square overdetermined linear systems is studied. The sparse QR technique is compared with two sparse LU-based techniques. Numerical tests with realworld and artificial matrices indicate that the LU techniques are more accurate for incompatible right-hand sides. Also, the amount of floating point operations required by LU techniques is approximately one half smaller than Q...
متن کاملAn incremental least squares algorithm for large scale linear classification
In this work we consider the problem of training a linear classifier by assuming that the number of data is huge (in particular, data may be larger than the memory capacity). We propose to adopt a linear leastsquares formulation of the problem and an incremental recursive algorithm which requires to store a square matrix (whose dimension is equal to the number of features of the data). The algo...
متن کاملStopping Criteria for the Iterative Solution of Linear Least Squares
We explain an interesting property of minimum residual iterative methods for the solution of the linear least squares (LS) problem. Our analysis demonstrates that the stopping criteria commonly used with these methods can in some situations be too conservative, causing any chosen method to perform too many iterations or even fail to detect that an acceptable iterate has been obtained. We propos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2018
ISSN: 0377-0427
DOI: 10.1016/j.cam.2018.05.037